Kurt Gödel , ‘ Über formal unentscheidbare
نویسنده
چکیده
First publication: Monatshefte für Mathematik und Physik, 37, 173–198 Reprints: S. Feferman et al., eds., Kurt Gödel. Collected Works. Volume I: Publications 1929–1936. New York: Oxford University Press, 1986, pp. 116–195. Translations: English translations: ‘On formally undecidable propositions of Principia mathematica and related systems I.’ Translation by B. Meltzer, On Formally Undecidable Propositions of Principia Mathematica and Related Systems, Edinburgh: Oliver and Boyd, 1962. Translation by E. Mendelsohn in M. Davis, The Undecidable, Hewlett, N.Y.: Raven Press, 1965, pp. 4–38. Translation and introduction by J. van Heijenoort in J. van Heijenoort (ed.), From Frege to Gödel. A Source Book in Mathematical Logic, Cambridge, Mass.: Harvard University Press, 1967, pp. 592–617. Van Heijenoort’s translation was approved by Gödel and is reprinted with an introduction by S. C. Kleene in S. Feferman et al., eds., Kurt Gödel. Collected Works. Volume I: Publications 1929–1936. New York: Oxford University Press, 1986, pp. 126– 195 (also contains several related pieces). Also reprinted in S. G. Shanker, Gödel’s Theorem in Focus, London: Routledge, 1988, pp. 17–47. Spanish translations: ‘Sobre proposiciones formalmente indecidibles de los Principia Mathematica y sistemas afines.’ Cuadernos Teorema 8. Valencia (Spain): Revista Teorema, 1980, by M. Garrido, A. Garcı́a Suarez, and L. Ml. Valdés.; ‘Sobre sentencias formalmente indecidibles de Principa Matematica y sistemas afines,’ In: K. Gödel, Obras Completas, J. Mosterı́n (ed.), Madrid: Alianza Editorial,1981, pp. 45–90. Portuguese translation: ‘Acerca de proposições formalmente indecidı́veis nos Principia Mathematica e sistemas relacionados’ in M. Lourenço (ed.),O teorema de Gödel e a hipótese do contı́nuo, Fundação Calouste Gulbenkian, Lisboa, 1979, pp. 245–290. Italian translations: ‘Proposizioni formalmente indecidibili dei Principia mathematica e di sistemi affini I’ in: E. Agazzi (ed.),Introduzione ai problemi dell’assiomatica, , Milano: Vita è Pensiero, 1961; K. Gödel, Opere (1929–1936), Turin: Bollati Boringhieri, 1999, ed. and trans., E. Ballo, S. Bozzi, G. Lolli and C. Mangione. Japanese translation: ‘Principia mathematica ya sono kanrentaikei deno keisikiteki ni ketteihukanou na meidai nitsuite I,’ in K. Hirose and K. Yokota (eds.), Gödel no sekai [Gödel’s World], Kaimeisha, 1985, pp. 165–202 Manuscripts: Two early drafts in Gabelsberger shorthand, the typewritten manuscript, page proofs, galley and an offprint held in the Kurt Gödel Papers at Princeton University Library, New Jersey.
منابع مشابه
The recent history of model theory
The history of Model Theory can be traced back to the work of Charles Sanders Peirce and Ernst Schröder, when semantics started playing a role in Logic. But the first outcome dates from 1915. It appears in the paper Über Möglichkeiten im Relativkalkül (Math. Ann. 76, 445-470) by Leopold Löwenheim. The period from 1915 to 1935 is, in words of R.L. Vaught, extraordinary. The method of elimination...
متن کامل2006: Celebrating 75 Years of AI - History and Outlook: The Next 25 Years
When Kurt Gödel layed the foundations of theoretical computer science in 1931, he also introduced essential concepts of the theory of Artificial Intelligence (AI). Although much of subsequent AI research has focused on heuristics, which still play a major role in many practical AI applications, in the new millennium AI theory has finally become a full-fledged formal science, with important opti...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملSketch-as-Proof
This paper presents an extension of Gentzen’s LK, called LPGK, which is suitable for expressing projective geometry and for deducing theorems of plane projective geometry. The properties of this calculus are investigated and the cut elimination theorem for LPGK is proven. A formulization of sketches is presented and the equivalence between sketches and formal proofs is demonstrated.
متن کاملKurt Gödel and Computability Theory
Although Kurt Gödel does not figure prominently in the history of computabilty theory, he exerted a significant influence on some of the founders of the field, both through his published work and through personal interaction. In particular, Gödel’s 1931 paper on incompleteness and the methods developed therein were important for the early development of recursive function theory and the lambda ...
متن کامل